Diophantine Undecidability of Holomorphy Rings of Function Fields of Characteristic 0 Laurent Moret-bailly and Alexandra Shlapentokh
ثبت نشده
چکیده
Let K be a one-variable function field over a field of constants of characteristic 0. Let R be a holomorphy subring of K, not equal to K. We prove the following undecidability results for R: If K is recursive, then Hilbert’s Tenth Problem is undecidable in R. In general, there exist x1, . . . , xn ∈ R such that there is no algorithm to tell whether a polynomial equation with coefficients in Q(x1, . . . , xn) has solutions in R.
منابع مشابه
Diophantine Undecidability of Holomorphy Rings of Function Fields of Characteristic
Let K be a one-variable function field over a field of constants of characteristic 0. Let R be a holomorphy subring of K, not equal to K. We prove the following undecidability results for R: If K is recursive, then Hilbert’s Tenth Problem is undecidable in R. In general, there exist x1, . . . , xn ∈ R such that there is no algorithm to tell whether a polynomial equation with coefficients in Q(x...
متن کاملUndecidability in Function Fields of Positive Characteristic
We prove that the first-order theory of any function field K of characteristic p > 2 is undecidable in the language of rings without parameters. When K is a function field in one variable whose constant field is algebraic over a finite field, we can also prove undecidability in characteristic 2. The proof uses a result by Moret-Bailly about ranks of elliptic curves over function fields.
متن کاملDiophantine Undecidability of Holomorphy Rings of Function Fields of Characteristic 0
— Let K be a one-variable function field over a field of constants of characteristic 0. Let R be a holomorphy subring of K, not equal to K. We prove the following undecidability results for R: if K is recursive, then Hilbert’s Tenth Problem is undecidable in R. In general, there exist x1, . . . , xn ∈ R such that there is no algorithm to tell whether a polynomial equation with coefficients in Q...
متن کاملDiophantine undecidability of function fields of characteristic greater than 2, finitely generated over fields algebraic over a finite field
Let F be a function field of characteristic p > 2, finitely generated over a field C algebraic over a finite field Cp and such that it has an extension of degree p. Then Hilbert’s Tenth Problem is not decidable over F .
متن کاملUndecidability in Function Fields of Positive Characteristic
We prove that the first-order theory of any function field K of characteristic p > 2 is undecidable in the language of rings without parameters. When K is a function field in one variable whose constant field is algebraic over a finite field, we can also prove undecidability in characteristic 2. The proof uses a result by Moret-Bailly about ranks of elliptic curves over function fields.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008